External Memory Geometric Data Structures

نویسنده

  • Lars Arge
چکیده

Many modern applications store and process datasets much larger than the main memory of even state-of-the-art high-end machines. Thus massive and dynamically changing datasets often need to be stored in space efficient data structures on external storage devices such as disks. In such cases the Input/Output (or I/O) communication between internal and external memory can become a major performance bottleneck. Many massive dataset applications involve geometric data (for example points, lines, and polygons) or data that can be interpreted geometrically. Such applications often perform queries that correspond to searching in massive multidimensional geometric databases for objects that satisfy certain spatial constraints. Typical queries include reporting the objects intersecting a query region, reporting the objects containing a query point, and reporting objects near a query point. While development of practically efficient (and ideally also multi-purpose) external memory data structures (or indexes) has always been a main concern in the database community, most data structure research in the algorithms community has focused on worst-case efficient internal memory data structures. Recently however, there has been some cross-fertilization between the two areas. In these lecture notes we discuss some of the recent advances in the development of worstcase efficient external memory geometric data structures. We will focus on fundamental dynamic structures for oneand two-dimensional orthogonal range searching, and try to highlight some of the fundamental techniques used to develop such structures. Accurately modeling memory and disk systems is a complex task. The primary feature of disks we want to model is their extremely long access time relative to that of internal memory. In order to amortize the access time over a large amount of data, typical disks read or write large blocks of contiguous data at once and therefore the standard two-level disk model has the following parameters:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

External Geometric Data Structures

Many modern applications store and process datasets much larger than the main memory of even state-of-the-art high-end machines. Thus massive and dynamically changing datasets often need to be stored in space efficient data structures on external storage devices such as disks, and in such cases the Input/Output (or I/O) communication between internal and external memory can become a major perfo...

متن کامل

External Memory Data Structures

In many massive dataset applications the data must be stored in space and query eecient data structures on external storage devices. Often the data needs to be changed dynamically. In this chapter we discuss recent advances in the development of provably worst-case ee-cient external memory dynamic data structures. We also brieey discuss some of the most popular external data structures used in ...

متن کامل

Field Study and Evaluation of Buckling Behavior of Cylindrical Steel Tanks with Geometric Imperfections under Uniform External Pressure

Construction and assembling process of shell structures has caused main problems. In these structures, there is no possibility for the integrated construction due to their large shell extent and they are built using a number of welded curved panel parts; hence, some geometrical imperfections emerge. Most of these imperfections are caused by the process of welding, transportation, inappropriate ...

متن کامل

Efficient External-Memory Data Structures and Applications

In this thesis we study the Input/Output (I/O) complexity of large-scale problems arising e.g. in the areas of database systems, geographic information systems, VLSI design systems and computer graphics, and design I/O-efficient algorithms for them. A general theme in our work is to design I/O-efficient algorithms through the design of I/O-efficient data structures. One of our philosophies is t...

متن کامل

Algorithms and Data Structures for External Memory

Data sets in large applications are often too massive to fit completely inside the computer’s internal memory. The resulting input/output communication (or I/O) between fast internal memory and slower external memory (such as disks) can be a major performance bottleneck. In this work we survey the state of the art in the design and analysis of algorithms and data structures for external memory ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002